An adaptive amoeba algorithm for shortest path tree computation in dynamic graphs
نویسندگان
چکیده
منابع مشابه
An Adaptive Amoeba Algorithm for Shortest Path Tree Computation in Dynamic Graphs
Xiaoge Zhang a,f, Qi Liub,c,g, Yong Hud, Felix T. S. Chane, Sankaran Mahadevanf, Zili Zhanga ,g, Yong Deng a,f* aSchool of Computer and Information Science, Southwest University, Chongqing 400715, China; bDepartment of Biomedical Informatics, Medical Center, Vanderbilt University, Nashiville, 37235, USA; cSchool of Life Sciences and Biotechnology, Shanghai Jiao Tong University, Shanghai, 200030...
متن کاملDaniel Aioanei LAZY SHORTEST PATH COMPUTATION IN DYNAMIC GRAPHS
We address the problem of single-source shortest path computation in digraphs with non-negative edge weights subjected to frequent edge weight decreases such that only some shortest paths are requested in-between updates. We optimise a recent semidynamic algorithm for weight decreases previously reported to be the fastest one in various conditions, resulting in important time savings that we de...
متن کاملAn Adaptive Distributed Dijkstra Shortest Path Algorithm
We give a distributed algorithm to compute shortest paths in a network with changing topology. It does not suffer from the routing table looping behavior associated with the Ford-Bellman tdistributed shortest path algorithm although it uses truly distributed processing. Its time and message complexities are evaluated. Pierre Humblet is with the Laboratory for Information and Decision Systems, M...
متن کاملANOTHER ADAPTIVE DISTRIBUTED SHORTEST PATH ALGORITHM Pierre
We give a distributed algorithm to compute shortest paths in a network with changing topology. It does not suffer from the routing table looping behavior associated with the FordBellman distributed shortest path algorithm although it uses truly distributed processing. Its time and message complexities are evaluated. Pierre Humblet is with the Laboratory for Information and Decision Systems, Mas...
متن کاملMinimum dynamic update for shortest path tree construction
Shortest path tree (SPT) computation is the major overhead for routers using any link-state routing protocols including the most widely used OSPF and IS-IS. Changes of link states are nowadays commonly occurred. It is not efficient and stable for network routing to use traditional static SPT algorithms to recompute the whole SPT whenever a change happens. In this paper, we present new dynamic a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2017
ISSN: 0020-0255
DOI: 10.1016/j.ins.2017.04.021